Smooth function extension based on high dimensional unstructured data
نویسندگان
چکیده
منابع مشابه
Smooth function extension based on high dimensional unstructured data
Many applications, including the image search engine, image inpainting, hyperspectral image dimensionality reduction, pattern recognition, and time series prediction, can be facilitated by considering the given discrete data–set as a point-cloud P in some high dimensional Euclidean space Rs. Then the problem is to extend a desirable objective function f from a certain relatively smaller trainin...
متن کاملA Note on the Smooth Estimator of the Quantile Function with Left-Truncated Data
This note focuses on estimating the quantile function based on the kernel smooth estimator under a truncated dependent model. The Bahadurtype representation of the kernel smooth estimator is established, and from the Bahadur representation it can be seen that this estimator is strongly consistent.
متن کاملMethods for regression analysis in high-dimensional data
By evolving science, knowledge and technology, new and precise methods for measuring, collecting and recording information have been innovated, which have resulted in the appearance and development of high-dimensional data. The high-dimensional data set, i.e., a data set in which the number of explanatory variables is much larger than the number of observations, cannot be easily analyzed by ...
متن کاملCache Based Multigrid on Unstructured Two Dimensional Grids
1. Abstract. High speed cache memory is commonly used to address the disparity between the speed of a computer's central processing unit and the speed of a computer's main memory. It is advantageous to maximize the amount of time that data spends in cache. Tiling is a software technique which is often used to do just this. Tiling is not able, however, to handle dynamically changing data structu...
متن کاملOn high dimensional data spaces
Data mining applications usually encounter high dimensional data spaces. Most of these dimensions contain ‘uninteresting’ data, which would not only be of little value in terms of discovery of any rules or patterns, but have been shown to mislead some classification algorithms. Since, the computational effort increases very significantly (usually exponentially) in the presence of a large number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02819-6